Strongly Minimal Self-Conjugate Linearizations for Polynomial and Rational Matrices

Strong Linearizations of Rational Matrices

This paper defines for the first time strong linearizations of arbitrary rational matrices, studies in depth properties and different characterizations of such linear matrix pencils, and develops infinitely many examples of strong linearizations that can be explicitly and easily constructed from a minimal state-space realization of the strictly proper part of the considered rational matrix and ...

Rational and Polynomial Matrices

where λ = s or λ = z for a continuousor discrete-time realization, respectively. It is widely accepted that most numerical operations on rational or polynomial matrices are best done by manipulating the matrices of the corresponding descriptor system representations. Many operations on standard matrices (such as finding the rank, determinant, inverse or generalized inverses, nullspace) or the s...

Minimal Degree Coprime Factorization of Rational Matrices

Given a rational matrix G with complex coefficients and a domain Γ in the closed complex plane, both arbitrary, we develop a complete theory of coprime factorizations of G over Γ, with denominators of McMillan degree as small as possible. The main tool is a general pole displacement theorem which gives conditions for an invertible rational matrix to dislocate by multiplication a part of the pol...

Minimal and canonical rational generator matrices for convolutional codes

A full-rank IC x n matrix G ( D ) over the rational functions F ( D ) generates a rate R = k / n convolutional code C. G ( D ) is minimal if it can be realized with as few memory elements as any encoder for C, and G ( D ) is canonical if it has a minimal realization in controller canonical form. We show that G ( D ) is minimal if and only if for all rational input sequences p1 ( D ) , the span ...

On the characterization and parametrization of strong linearizations of polynomial matrices